Fast computation of morphological operations with arbitrary structuring elements
نویسندگان
چکیده
This paper presents a general algorithm that performs basic mathematical morphology operations, like erosions and openings, with any arbitrary shaped structuring element in an efficient way. It is shown that our algorithm has a lower or equal complexity but better computing time than all comparable known methods.
منابع مشابه
Fast Implementation Of Morphological Operations Using Binary Image Block Decomposition
Morphological transformations are commonly used to perform a variety of image processing tasks. However, morphological operations are time-consuming procedures since they involve ordering and min/max computation of numbers resulting from image interaction with structuring elements. This paper presents a new method that can be used to speed up basic morphological operations for binary images. To...
متن کاملEfficient convolution based algorithms for erosion and dilation
Morphological operations based on primitives such as dilation and erosion are slow to compute in practice especially for large structuring elements. For direct implementation of these primitives, the computing time grows exponentially with the size of the structuring element used. The latter renders these implementations impractical for large structuring elements due to a rapid increase in comp...
متن کاملPartial-result-reuse architecture and its design technique for morphological operations
This paper proposes a new cost-effective architecture for mathematical morphology named Partial-Result-Reuse (PRR) architecture. For a lot of real-time applications of mathematical morphology, the hardware implementation is necessary; however, the hardware cost of almost existing morphology architectures is too high when dealing with large structuring elements. With partial-resultreuse concept ...
متن کاملA Partial-result-reuse Architecture and Its Design Technique for Morphological Operations
This paper proposes a new cost-effective architecture for mathematical morphology named Partial-Result-Reuse (PRR) architecture. For a lot of real-time applications of mathematical morphology, the hardware implementation is necessary; however, the hardware cost of almost existing morphology architectures is too high when dealing with large structuring elements. With partial-resultreuse concept ...
متن کامل3 D Binary Fast Morphological
In this paper the use of a fast algorithm for implementing shape decomposition of 3D binary objects is proposed. Shape decomposition is performed by successive 3D erosions and dilations, using 3D structuring elements of arbitrary size and shape. The proposed fast shape decomposition algorithm is based on a fast implementation of the basic morphological operation of Minkowski addition for the sp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 17 شماره
صفحات -
تاریخ انتشار 1996